On Newton–Raphson Iteration for Multiplicative Inverses Modulo Prime Powers
نویسندگان
چکیده
منابع مشابه
On Newton-Raphson iteration for multiplicative inverses modulo prime powers
We study algorithms for the fast computation of modular inverses. Newton-Raphson iteration over p-adic numbers gives a recurrence relation computing modular inverse modulo p, that is logarithmic in m. We solve the recurrence to obtain an explicit formula for the inverse. Then we study different implementation variants of this iteration and show that our explicit formula is interesting for small...
متن کاملCongruences modulo Prime Powers
Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f (x) ∈ Z[x]. We establish the congruence p deg f k≡r (mod p α) n k (−1) k f k − r p α ≡ 0 mod p ∞ i=α ⌊n/p i ⌋ (motivated by a conjecture arising from algebraic topology), and obtain the following vast generalization of Lucas' theorem: If α > 1 and l, s, t are nonnegative integers with s, t < p, then 1 ⌊n/p α−1 ⌋! k≡r (...
متن کاملExponential Sums modulo Prime Powers
where p is a prime power with m ≥ 2, χ is a multiplicative character (mod p), epm(·) is the additive character, epm(x) = e 2πix pm , and f, g are rational functions with integer coefficients. It is understood, that the sum is only over values of x for which g and f and both defined as functions on Z/(p), and g is nonzero (mod p). The sum is trivial if f and g are both constants, so we shall alw...
متن کاملOn Modular Galois Representations modulo Prime Powers
On modular Galois representations modulo prime powers Chen, Imin; Kiming, Ian; Wiese, Gabor Published in: International Journal of Number Theory DOI: 10.1142/S1793042112501254 Publication date: 2013 Document Version Publisher's PDF, also known as Version of record Citation for published version (APA): Chen, I., Kiming, I., & Wiese, G. (2013). On modular Galois representations modulo prime power...
متن کاملCombinatorial Congruences modulo Prime Powers
Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f(x) ∈ Z[x]. We establish the congruence p f ∑ k≡r (mod pα) (n k ) (−1)f ( k − r pα ) ≡ 0 ( mod p ∑∞ i=α n/p i ) (motivated by a conjecture arising from algebraic topology) and obtain the following vast generalization of Lucas’ theorem: If α is greater than one, and l, s, t are nonnegative integers with s, t < p, then 1 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2014
ISSN: 0018-9340
DOI: 10.1109/tc.2013.94